Plane hop spanners for unit disk graphs: Simpler and better
نویسندگان
چکیده
منابع مشابه
Planar Hop Spanners for Unit Disk Graphs
The simplest model of a wireless network graph is the Unit Disk Graph (UDG): an edge exists in UDG if the Euclidean distance between its endpoints is ≤ 1. The problem of constructing planar spanners of Unit Disk Graphs with respect to the Euclidean distance has received considerable attention from researchers in computational geometry and ad-hoc wireless networks. In this paper, we present an a...
متن کاملDegree Four Plane Spanners: Simpler and Better
Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose point-set is P. Each edge in C between two points p, q is realized as the line segment [pq], and is assigned a weight equal to the Euclidean distance |pq|. In this paper, we show how to construct inO(n lgn) time a plane spanner of C of maximum degree at most 4 and of stretch factor at most 20. This...
متن کاملCollective Tree Spanners for Unit Disk Graphs with Applications
In this paper, we establish a novel balanced separator theorem for Unit Disk Graphs (UDGs), which mimics the well-known Lipton and Tarjan’s planar balanced shortest paths separator theorem. We prove that, in any n-vertex UDG G, one can find two hop-shortest paths P (s, x) and P (s, y) such that the removal of the 3-hopneighborhood of these paths (i.e., N G[P (s, x)∪P (s, y)]) from G leaves no c...
متن کاملNew Doubling Spanners: Better and Simpler
In a seminal STOC’95 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces with constant maximum degree, hop-diameter O(logn) and lightness O(logn) (i.e., weight O(logn)· w(MST)) can be constructed in O(n logn) time. This conjecture, which became a central open question in this area, was resolved in the affirmative by Elkin and Solomon in STOC’13 (even for doubling m...
متن کاملOn Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor Cdel ≈ 2.42; however, its degree may not be bounded. Our first result is a very simple linear time algorithm for constructing a subgraph of the Delaunay graph with stretch factor ρ = 1 + ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2020
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2020.101622